Multichannel Hankel Matrix Completion Through Nonconvex Optimization
نویسندگان
چکیده
منابع مشابه
Quasi-Hankel low-rank matrix completion: a convex relaxation
The completion of matrices with missing values under the rank constraint is a non-convex optimization problem. A popular convex relaxation is based on minimization of the nuclear norm (sum of singular values) of the matrix. For this relaxation, an important question is whether the two optimization problems lead to the same solution. This question was addressed in the literature mostly in the ca...
متن کاملInterpolation using Hankel tensor completion
We present a novel multidimensional seismic trace interpolator that works on constant-frequency slices. It performs completion on Hankel tensors whose order is twice the number of spatial dimensions. Completion is done by fitting a PARAFAC model using an Alternating Least Squares algorithm. The new interpolator runs quickly and can better handle large gaps and high sparsity than existing comple...
متن کاملMatrix completion via max-norm constrained optimization
This paper studies matrix completion under a general sampling model using the max-norm as a convex relaxation for the rank of the matrix. The optimal rate of convergence is established for the Frobenius norm loss. It is shown that the max-norm constrained minimization method is rate-optimal and it yields a more stable approximate recovery guarantee, with respect to the sampling distributions, t...
متن کاملLow-Rank Matrix Completion by Riemannian Optimization
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a novel algorithm for matrix completion that minimizes the least square distance on the sampling set over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical non-linear conjugate gradients, developed within the framework o...
متن کاملDistance Matrix Completion by Numerical Optimization
10 to a distance matrix|if a completion does exist, then typically we want to nd it. Although the numerical optimization approach is not deenitive in the sense of Johnson and Tarazaga 8], it is constructive in the sense that it produces a sequence of dissimilarity matrices that converges to a completion. Beyond its ability to construct (approximate) completions, the compelling advantage of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2018
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2018.2827299